Distributed, scalable routing based on link-state vectors

Distributed, Scalable Routing Based on Vectors of Link States

Link vector algorithms (LVA) are introduced for the distributed maintenance of routing information in large networks and internets. According to an LVA, each router maintains a subset of the topology that corresponds to adjacent links and those links used by its neighbor routers in their preferred paths to known destinations. Based on that subset of topology information, the router derives its ...

Scalable Link-State Internet Routing

We present and verify the Adaptive Link-State Protocol (ALP), a new link-state routing protocol that does not require the state of each link to be flooded to the entire internetwork, or to entire areas if hierarchical routing is used. A router in ALP disseminates link-state updates incrementally to its neighbors for only those links along paths used to reach destinations. Link-state updates are...

Hierarchical Routing Using Link Vectors

An area-based link-vector algorithm (ALVA) is introduced for the distributed maintenance of routing information in very large internetworks. According to ALVA, destinations in an internetwork are aggregated in areas in multiple levels of hierarchy. Routers maintain a database that contains a subset of the topology at each level of the hierarchy. This subset corresponds to those links used in pr...

A scalable algorithm for link-state QoS-based routing with three metrics

On State Aggregation for Scalable QoS Routing

State (topology) aggregation is the notion of reducing nodal as well as link information to achieve scaling in a large network. In this paper, we compare the performance of three diierent aggregation schemes, namely, the Simple-Node scheme, the Full-Mesh scheme, and the Star scheme, which represent a given group of nodes by a single logical node, a complete graph between border nodes, and a sta...